全文获取类型
收费全文 | 300篇 |
免费 | 62篇 |
国内免费 | 49篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 15篇 |
2020年 | 10篇 |
2019年 | 11篇 |
2018年 | 6篇 |
2017年 | 21篇 |
2016年 | 19篇 |
2015年 | 10篇 |
2014年 | 19篇 |
2013年 | 16篇 |
2012年 | 26篇 |
2011年 | 19篇 |
2010年 | 12篇 |
2009年 | 36篇 |
2008年 | 20篇 |
2007年 | 22篇 |
2006年 | 32篇 |
2005年 | 27篇 |
2004年 | 16篇 |
2003年 | 9篇 |
2002年 | 7篇 |
2001年 | 13篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有411条查询结果,搜索用时 15 毫秒
81.
82.
83.
在分析车载超宽带合成孔径雷达(UWB SAR)探测系统中干扰类型及其产生机理的基础上,针对Tsaipei Wang等提出的批处理方法的局限性,提出一种基于迭代运算的图像域自适应干扰抑制方法.该方法利用基于韦布尔分布的恒虚警率(CFAR)检测器提高干扰信号估计的准确性;采用迭代方法在线估计和更新参数,实现干扰的自适应抑制.实测数据处理结果表明:该方法可有效抑制自信号干扰,且结构上适于实时处理,可满足车载UWB SAR探测系统对图像预处理的要求. 相似文献
84.
空间飞行器及其推进系统由于系统本身的复杂性、工作环境的不确定性和未知性等,利用传统的现代控制理论与方法对其进行控制十分困难。文中深入分析了智能自治控制系统内涵、功能及其构成框架,解析了空间飞行器RemoteAgent智能自治控制系统的基本构成,对空间飞行器推进系统重构问题进行了应用分析,对研究和发展我国空间飞行器的智能自治控制系统有一定的借鉴作用。 相似文献
85.
86.
87.
88.
89.
We consider a mixed‐model assembly line (MMAL) comprised a set of workstations and a conveyor. The workstations are arranged in a serial configuration. The conveyor moves at a constant speed along the workstations. Initial units belonging to different models are successively fed onto the conveyor, and they are moved by the conveyor to pass through the workstations to gradually generate final products. All assembling tasks are manually performed with operation times to be stochastic. An important performance measure of MMALs is overload times that refer to uncompleted operations for operators within their work zones. This paper establishes a method to analyze the expected overload times for MMALs with stochastic operation times. The operation processes of operators form discrete time nonhomogeneous Markov processes with continuous state spaces. For a given daily production schedule, the expected overload times involve in analyzing the Markov processes for finite horizon. Based on some important properties of the performance measure, we propose an efficient approach for calculating the expected overload times. Numerical computations show that the results are very satisfactory. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
90.
This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献